Words with the Maximum Number of Abelian Squares
نویسندگان
چکیده
An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain Θ(n) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.
منابع مشابه
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
The combinatorics of squares in a word depends on how the equivalence of halves of the square is defined. We consider Abelian squares, parameterized squares and order-preserving squares. The word uv is an Abelian (parameterized, order-preserving) square if u and v are equivalent in the Abelian (parameterized, order-preserving) sense. The maximum number of ordinary squares is known to be asympto...
متن کاملOn the Unavoidability of k-Abelian Squares in Pure Morphic Words
We consider a recently defined notion of k-abelian equivalence of words by concentrating on avoidability problems. The equivalence class of a word depends on the number of occurrences of different factors of length k for a fixed natural number k and the prefix of the word. We show that over a ternary alphabet, k-abelian squares cannot be avoided in pure morphic words for any natural number k. N...
متن کاملAvoiding abelian squares in partial words
Erdös raised the question whether there exist infinite abelian squarefree words over a given alphabet, that is, words in which no two adjacent subwords are permutations of each other. It can easily be checked that no such word exists over a three-letter alphabet. However, infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investi...
متن کاملAvoidability of long k-abelian repetitions
We study the avoidability of long k-abelian-squares and k-abeliancubes on binary and ternary alphabets. For k = 1, these are Mäkelä’s questions. We show that one cannot avoid abelian-cubes of abelian period at least 2 in infinite binary words, and therefore answering negatively one question from Mäkelä. Then we show that one can avoid 3-abelian-squares of period at least 3 in infinite binary wo...
متن کاملCrucial Words for Abelian Powers
In 1961, Erdős asked whether or not there exist words of arbitrary length over a fixed finite alphabet that avoid patterns of the form XX ′ where X ′ is a permutation of X (called abelian squares). This problem has since been solved in the affirmative in a series of papers from 1968 to 1992. Much less is known in the case of abelian k-th powers, i.e., words of the form X1X2 . . . Xk where Xi is...
متن کامل